Models, postulates, and generalized nomic truth approximation

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lorentzian quantum reality: postulates and toy models.

We describe postulates for a novel realist version of relativistic quantum theory or quantum field theory in Minkowski space and other background space-times, and illustrate their application with toy models.

متن کامل

Parameter Estimation in Spatial Generalized Linear Mixed Models with Skew Gaussian Random Effects using Laplace Approximation

 Spatial generalized linear mixed models are used commonly for modelling non-Gaussian discrete spatial responses. We present an algorithm for parameter estimation of the models using Laplace approximation of likelihood function. In these models, the spatial correlation structure of data is carried out by random effects or latent variables. In most spatial analysis, it is assumed that rando...

متن کامل

fragmentability and approximation

in chapter 1, charactrizations of fragmentability, which are obtained by namioka (37), ribarska (45) and kenderov-moors (32), are given. also the connection between fragmentability and its variants and other topics in banach spaces such as analytic space, the radone-nikodym property, differentiability of convex functions, kadec renorming are discussed. in chapter 2, we use game characterization...

15 صفحه اول

Nomic-Role Nonreductionsim: Identifying Properties by Total Nomic Roles

I introduce “nomic-role nonreductionism” as an alternative to causal-role functionalism in the philosophy of mind. It is inspired by recent trends in cognitive science that emphasize embodied cognition and multi-level methods of explanation in the special sciences. While causal-role functionalists identify mental properties by an intra-level transition theory that describes relations between in...

متن کامل

Constructing Simplified Plans Via Truth Criteria Approximation

This paper has presented an approach to dealing with the complexity of explanation-based learning plans in complex domains. This approach uses a simplified algorithm to construct plans, and employs later refinements to repair bugs in constructed plans. This algorithm has the theoretical properties of completeness and convergence upon soundness. This incremental reasoning planning and learning a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Synthese

سال: 2015

ISSN: 0039-7857,1573-0964

DOI: 10.1007/s11229-015-0916-9